Preserving positivity for matrices with sparsity constraints
نویسندگان
چکیده
منابع مشابه
Preserving Positivity for Matrices with Sparsity Constraints
Functions preserving Loewner positivity when applied entrywise to positive semidefinite matrices have been widely studied in the literature. Following the work of Schoenberg [Duke Math. J. 9], Rudin [Duke Math. J. 26], and others, it is well-known that functions preserving positivity for matrices of all dimensions are absolutely monotonic (i.e., analytic with nonnegative Taylor coefficients). I...
متن کاملEstimation of Covariance Matrices under Sparsity Constraints
Discussion of “Minimax Estimation of Large Covariance Matrices under L1-Norm” by Tony Cai and Harrison Zhou. To appear in Statistica Sinica. Introduction. Estimation of covariance matrices in various norms is a critical issue that finds applications in a wide range of statistical problems, and especially in principal component analysis. It is well known that, without further assumptions, the em...
متن کاملAn efficient nonstandard numerical method with positivity preserving property
Classical explicit finite difference schemes are unsuitable for the solution of the famous Black-Scholes partial differential equation, since they impose severe restrictions on the time step. Furthermore, they may produce spurious oscillations in the solution. We propose a new scheme that is free of spurious oscillations and guarantees the positivity of the solution for arbitrary stepsizes. The...
متن کاملTrading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the resulting optimization problem is generally NP-hard, several approximation algorithms are considered. We analyze the performance of these algorithms, focusing on the characterization of the trade-off between accuracy a...
متن کاملSparsity Preserving Algorithms for Octagons
Known algorithms for manipulating octagons do not preserve their sparsity, leading typically to quadratic or cubic time and space complexities even if no relation among variables is known when they are all bounded. In this paper, we present new algorithms, which use and return octagons represented as weakly closed difference bound matrices, preserve the sparsity of their input and have better p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2016
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran6669